منابع مشابه
On the linear least-square prediction problem
An efficient algorithm is derived for the recursive computation of the filtering and all types of linear leastsquare prediction estimates (fixed-point, fixed-interval, and fixed-lead predictors) of a nonstationary signal vector. It is assumed that the signal is observed in the presence of an additive white noise which can be correlated with the signal. The methodology employed only requires tha...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملAn analysis of the Least Median of Squares regression problem
The optimization problem that arises out of the least median of squared residuals method in linear regression is analyzed. To simplify the analysis, the problem is replaced by an equivalent one of minimizing the median of absolute residuals. A useful representation of the last problem is given to examine properties of the objective function and estimate the number of its local minima. It is sho...
متن کاملOn the DCJ Median Problem
As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data given at the leaves.When phrased as an optimization problem, this problem reduces to computing a median of three genomes under the operations (e...
متن کاملOn the Matrix Median Problem
The Genome Median Problem is an important problem in phylogenetic reconstruction under rearrangement models. It can be stated as follows: given three genomes, find a fourth that minimizes the sum of the pairwise rearrangement distances between it and the three input genomes. Recently, Feijão and Meidanis extended the algebraic theory for genome rearrangement to allow for linear chromosomes, thu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2006
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-006-1267-6